Convex polytopes and quantum separability

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Polytopes

The study of convex polytopes in Euclidean space of two and three dimensions is one of the oldest branches of mathematics. Yet many of the more interesting properties of polytopes have been discovered comparatively recently, and are still unknown to the majority of mathematicians. In this paper we shall survey the subject, mentioning some of the most recent results, and stating the more importa...

متن کامل

Convex polytopes and linear algebra

This paper defines, for each convex polytope ∆, a family Hw∆ of vector spaces. The definition uses a combination of linear algebra and combinatorics. When what is called exact calculation holds, the dimension hw∆ of Hw∆ is a linear function of the flag vector f∆. It is expected that the Hw∆ are examples, for toric varieties, of the new topological invariants introduced by the author in Local-gl...

متن کامل

Basic Properties of Convex Polytopes

Convex polytopes are fundamental geometric objects that have been investigated since antiquity. The beauty of their theory is nowadays complemented by their importance for many other mathematical subjects, ranging from integration theory, algebraic topology, and algebraic geometry (toric varieties) to linear and combinatorial optimization. In this chapter we try to give a short introduction, pr...

متن کامل

Barycentric coordinates for convex polytopes

An extension of the standard barycentric coordinate functions for simplices to arbitrary convex polytopes is described. The key to this extension is the construction, for a given convex polytope, of a unique polynomial associated with that polytope. This polynomial, the adjoint of the polytope, generalizes a previous two-dimensional construction described by Wachspress. The barycentric coordina...

متن کامل

Domain Triangulation Between Convex Polytopes

In this paper, we propose a method for solving the problem triangulation of a domain between convex polyhedrons in ddimensional space using Delaunay triangulation in O(N) time. Novelty of our work is in using a modified Delaunay triangulation algorithm with constraints.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2011

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.84.062327